Predicate Logic for Functors and Monads
نویسنده
چکیده
This paper starts from the elementary observation that what is usually called a predicate lifting in coalgebraic modal logic is in fact an endomap of indexed categories. This leads to a systematic review of basic results in predicate logic for functors and monads, involving induction and coinduction principles for functors and compositional modal operators for monads.
منابع مشابه
Equational presentations of functors and monads
In categorical universal algebra, it is well known that a finitary equational presentation of algebras in a finitary variety K amounts to the existence of a coequaliser of a pair of morphisms between finitely generated free algebras. The essence of a universal-algebraic flavour of a finitary functor L : K −→ K is that L is determined by its behaviour on finitely generated free algebras. In fact...
متن کاملFree Applicative Functors
Applicative functors [6] are a generalisation of monads. Both allow the expression of effectful computations into an otherwise pure language, like Haskell [5]. Applicative functors are to be preferred to monads when the structure of a computation is fixed a priori. That makes it possible to perform certain kinds of static analysis on applicative values. We define a notion of free applicative fu...
متن کاملPolynomial Functors and Polynomial Monads
We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a polynomial endofunctor is polynomial. The relationship with operads and other related notions is explored. Introduction Background. Notions of polynomial functor ha...
متن کاملPredicate Functors Revisited
Quantification theory, or first-order predicate logic, can be formulated in terms purely of predicate letters and a few predicate functors which attach t o predicates to form further predicates. Apart from the predicate letters, which are schematic, there are no variables. On this score the plan is reminiscent of the combinatory logic of Schonfinkel and Curry. Theirs, however, had the whole of ...
متن کاملDijkstra and Hoare monads in monadic computation
The Dijkstra and Hoare monads have been introduced recently for capturing weakest precondition computations and computations with preand post-conditions, within the context of program verification, supported by a theorem prover. Here we give a more general description of such monads in a categorical setting. We first elaborate the recently developed view on program semantics in terms of a trian...
متن کامل